منابع مشابه
Monoid-labeled transition systems
Given a ∨ -complete (semi)lattice L, we consider L-labeled transition systems as coalgebras of a functor L(−), associating with a set X the set LX of all L-fuzzy subsets. We describe simulations and bisimulations of L-coalgebras to show that L(−) weakly preserves nonempty kernel pairs iff it weakly preserves nonempty pullbacks iff L is join infinitely distributive (JID). Exchanging L for a comm...
متن کاملDifferencing Labeled Transition Systems
Concurrent programs often use Labeled Transition Systems (LTSs) as their operational semantic models, which provide the basis for automatic system analysis and verification. System behaviors (generated from the operational semantics) evolve as programs evolve for fixing bugs or implementing new user requirements. Even when a program remains unchanged, its LTS models explored by a model checker ...
متن کامل(De-)Composing Causality in Labeled Transition Systems
In this paper we introduce a notion of counterfactual causality in the Halpern and Pearl sense that is compositional with respect to the interleaving of transition systems. The formal framework for reasoning on what caused the violation of a safety property is established in the context of labeled transition systems and Hennessy Milner logic. The compositionality results are devised for noncomm...
متن کاملState-event Observers for Labeled Transition Systems
In many Discrete-Event Systems (DES) both state and event information are of importance to the systems designer. As a first step towards obtaining hierarchical models of systems, the behavior of Discrete-Event Systems with unobservable transitions and state output maps is considered. Observers for deterministic DES are generalized to nondeterministic DES and characterized using the join semilat...
متن کاملUniform Labeled Transition Systems for Nondeterministic, Probabilistic, and Stochastic Processes
Rate transition systems (RTS) are a special kind of transition systems introduced for defining the stochastic behavior of processes and for associating continuous-time Markov chains with process terms. The transition relation assigns to each process, for each action, the set of possible futures paired with a measure indicating the rates at which they are reached. RTS have been shown to be a uni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2001
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)80908-3